Satisfiability modulo theories - PDFSEARCH.IO - Document Search Engine

Satisfiability modulo theories
Results: 199

#	Item
151	Learning Universally Quantified Invariants of Linear Data Structures Pranav Garg1 , Christof L¨oding2 , P. Madhusudan1 , and Daniel Neider2 1 University of Illinois at Urbana-Champaign Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-08-07 05:31:08 Automata theory Models of computation Logic in computer science Formal methods Computability theory Satisfiability Modulo Theories Lookup table Deterministic finite automaton Decision problem Theoretical computer science Applied mathematics Mathematics
152	COMP 4161 NICTA Advanced Course Advanced Topics in Software Verification Toby Murray, June Andronick, Gerwin Klein 1 Add to Reading List Source URL: cs4161.web.cse.unsw.edu.au Language: English - Date: 2014-11-10 04:09:39 Formal methods Computer law Copyleft Automated theorem proving Logic in computer science Isabelle SPASS Paul Gottlieb Nipkow Satisfiability Modulo Theories Theoretical computer science Mathematical software Applied mathematics
153	technology from seed Verifying Optimizations using SMT Solvers Nuno Lopes Add to Reading List Source URL: llvm.org Language: English - Date: 2013-12-16 20:46:26 Mathematical optimization Operations research Constraint programming Logic in computer science Electronic design automation Satisfiability Modulo Theories Solver Nl AMPL Theoretical computer science Applied mathematics Mathematics
154	PDF Document Add to Reading List Source URL: isabelle.in.tum.de Language: English - Date: 2014-08-27 06:04:04 Formal methods Automated theorem proving Mathematical logic Constraint programming SPASS Isabelle Satisfiability Modulo Theories Mathematical proof Vampire Theoretical computer science Mathematics Applied mathematics
155	Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) Don’t care in SMT⋆ Building flexible yet efficient abstraction/refinement solvers Andreas Bauer1 , Martin Leucker2 , Christian Sc Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2009-10-01 20:34:14 Mathematics Model theory Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Constraint satisfaction problem Symbol Theoretical computer science Constraint programming Mathematical logic
156	Don’t care in SMT—Building flexible yet efficient abstraction/refinement solvers1 Andreas Bauer∗ , Martin Leucker∗∗, Christian Schallhart∗∗, Michael Tautschnig∗∗ ∗ ∗∗ Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2007-11-26 20:10:39 Mathematics Logic in computer science Electronic design automation Formal methods NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Constraint satisfaction problem Solver Theoretical computer science Constraint programming Applied mathematics
157	Tool-support for the analysis of hybrid systems and models Andreas Bauer Markus Pister Michael Tautschnig Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2012-10-30 05:38:27 Operations research Constraint programming Logic in computer science Electronic design automation Formal methods Satisfiability Modulo Theories Solver Boolean satisfiability problem Constraint satisfaction Theoretical computer science Applied mathematics Mathematics
158	Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. Paulson Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2015-01-25 16:18:54 Logic in computer science Automated theorem proving Formal methods Constraint programming Satisfiability Modulo Theories Isabelle Proof assistant Automated reasoning E theorem prover Theoretical computer science Applied mathematics Mathematics
159	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-04-02 18:01:43 Automated theorem proving Formal methods NP-complete problems Constraint programming Logic in computer science True quantified Boolean formula Resolution Satisfiability Modulo Theories Unsatisfiable core Theoretical computer science Mathematics Logic
160	metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener, Mathias Soeken, Clemens Werther, Görschwin Fey and Rolf Drechsler University of Bremen [removed] Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-10-20 06:13:55 C++ Constraint programming Electronic design automation Satisfiability Modulo Theories Z3 X26 Typedef X38 CTX Theoretical computer science Applied mathematics NP-complete problems